\mu-\mu^{*} - Connectedness via Hereditary Classes

Ambiguous classes in mu-calculi hierarchies

A classical result by Rabin states that if a set of trees and its complement are both Büchi definable in the monadic second order logic, then these sets are weakly definable. In the language of -calculi, this theorem asserts the equality between the complexity classes 2 ∩ 2 and Comp( 1, 1) of the fixed-point alternation-depth hierarchy of the -calculus of tree languages. It is natural to ask wh...

Superdeduction in Lambda-Bar-Mu-Mu-Tilde

Superdeduction is a method specially designed to ease the use of first-order theories in predicate logic. The theory is used to enrich the deduction system with new deduction rules in a systematic, correct and complete way. A proof-term language and a cut-elimination reduction already exist for superdeduction, both based on Christian Urban’s work on classical sequent calculus. However the compu...

Truncated mu (mu') chains in murine IgM. Evidence that mu' chains lack variable regions

Secreted IgM was shown to contain truncated mu (mu') chains with an apparent molecular mass of approximately 55 kD. The estimated percentage of IgM heavy (H) chains in the mu' form ranged from less than or equal to 1% in the case of one tumor IgM protein (104E) to greater than or equal to 30% in normal serum IgM. Serum mu' chains lacked antigenic determinants characteristic of immunoglobulin va...

How mu h 1 How mu h 1 How mu h 12

How mu h 1 How mu h 1 How mu h 12 wood 2 wood 2